Nuprl Lemma : all-but-one 11,40

T:Type, P:(T), L:(T List).
(0 < ||L||)
 (xy:T. Dec(x = y))
 ((xLyL. ((x = y  T))  (P(x P(y)))  (xL.yL. ((x = y  T))  P(y))) 
latex


Definitionsx:AB(x), , P  Q, ||as||, P  Q, A, P  Q, x(s), Y, P & Q, P  Q, False, t  T, xt(x), xLP(x), {T}, (xL.P(x)), x:AB(x), l[i], {i..j}, i  j < k, hd(l), nth_tl(n;as), if b then t else f fi , i j, b, i <z j, tt, ff, Dec(P)
Lemmasl all wf2, not wf, l member wf, l exists wf, decidable wf, implies functionality wrt iff, iff wf, iff functionality wrt iff, l exists cons, member wf, iff transitivity, l all cons, and functionality wrt iff, or functionality wrt iff, false wf, l exists nil, l all nil, length wf1, non neg length, cons member, select member, le wf

origin